Relationals Morphisms and Operations on Recognizable Sets

نویسنده

  • Howard Straubing
چکیده

— Relational morphisms betweenfinite monoids (a notion due to Tilson) are used to study the effect certain opérations on recognizabie sets have on the syntactic monoids ofthose sets. This leads to concise proofs ofa number ofknown results concerning the product opération, and a new resuit concerning the star opération. Résumé. — On utilise les morphismes relationnels (dus à Tilson) pour étudier F effet que certaines opérations sur les langages reconnaissables produisent sur les monoïdes syntactiques de ces langages. On obtient ainsi des démonstrations simples pour plusieurs résultats déjà connus sur Vopération de produit et un résultat nouveau sur Vopération étoile.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Relational morphisms, transductions and operations on languages

The aim of the article is to present two algebraic tools (the representable transductions and the relational morphisms) that have been used in the past decade to study operations on recognizable languages. This study reserves a few surprises. Indeed, both concepts were originally introduced for other purposes : representable transductions are a formalization of automata with output and have bee...

متن کامل

Recognizability for Sequences of Morphisms

We investigate different notions of recognizability for a free monoid morphism σ : A∗ → B∗. Full recognizability occurs when each (aperiodic) point in BZ admits at most one tiling with words σ(a), a ∈ A. This is stronger than the classical notion of recognizability of a substitution σ : A∗ → A∗, where the tiling must be compatible with the language of the substitution. We show that if |A| = 2, ...

متن کامل

Recognizability, hypergraph operations, and logical types

We study several algebras of graphs and hypergraphs and the corresponding notions of equational sets and recognizable sets. We generalize and unify several existing results which compare the associated equational and recognizable sets. The basic algebra on relational structures is based on disjoint union and quantifier-free definable operations. We expand it to an equivalent one by adding opera...

متن کامل

Operations on Weakly Recognizing Morphisms

Weakly recognizing morphisms from free semigroups onto finite semigroups are a classical way for defining the class of ω-regular languages, i.e., a set of infinite words is weakly recognizable by such a morphism if and only if it is accepted by some Büchi automaton. We consider the descriptional complexity of various constructions for weakly recognizing morphisms. This includes the conversion f...

متن کامل

Asymptotic properties of free monoid morphisms

Motivated by applications in the theory of numeration systems and recognizable sets of integers, this paper deals with morphic words when erasing morphisms are taken into account. Cobham showed that if an infinite word w = g(f(a)) is the image of a fixed point of a morphism f under another morphism g, then there exist a non-erasing morphism σ and a coding τ such that w = τ (σ(b)). Based on the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • ITA

دوره 15  شماره 

صفحات  -

تاریخ انتشار 1981